Understanding disease processes by partitioned dynamic Bayesian networks
نویسندگان
چکیده
منابع مشابه
Agreement in Partitioned Dynamic Networks
In the dynamic network model, the communication graph is assumed to be connected in every round but is otherwise arbitrary. We consider the related setting of p-partitioned dynamic networks, in which the communication graph in each round consists of at most p connected components. We explore the problem of k-agreement in this model for k ≥ p. We show that if the number of processes is unknown t...
متن کاملDynamic Bayesian Networks as Formal Abstractions of Structured Stochastic Processes
We study the problem of finite-horizon probabilistic invariance for discrete-time Markov processes over general (uncountable) state spaces. We compute discrete-time, finite-state Markov chains as formal abstractions of general Markov processes. Our abstraction differs from existing approaches in two ways. First, we exploit the structure of the underlying Markov process to compute the abstractio...
متن کاملActive Learning of Dynamic Bayesian Networks in Markov Decision Processes
Several recent techniques for solving Markov decision processes use dynamic Bayesian networks to compactly represent tasks. The dynamic Bayesian network representation may not be given, in which case it is necessary to learn it if one wants to apply these techniques. We develop an algorithm for learning dynamic Bayesian network representations of Markov decision processes using data collected t...
متن کاملUnderstanding Social Contagion in Adoption Processes Using Dynamic Social Networks
There are many studies in the marketing and diffusion literature of the conditions in which social contagion affects adoption processes. Yet most of these studies assume that social interactions do not change over time, even though actors in social networks exhibit different likelihoods of being influenced across the diffusion period. Rooted in physics and epidemiology theories, this study prop...
متن کاملFinding optimal Bayesian networks by dynamic programming
Finding the Bayesian network that maximizes a score function is known as structure learning or structure discovery. Most approaches use local search in the space of acyclic digraphs, which is prone to local maxima. Exhaustive enumeration requires super-exponential time. In this paper we describe a “merely” exponential space/time algorithm for finding a Bayesian network that corresponds to a glo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Biomedical Informatics
سال: 2016
ISSN: 1532-0464
DOI: 10.1016/j.jbi.2016.05.003